A Pointwise Lipschitz Selection Theorem

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pointwise construction of Lipschitz aggregation operators

This paper establishes tight upper and lower bounds on Lipschitz aggregation operators considering their diagonal, opposite diagonal and marginal sections. Also we provide explicit formulae to determine the bounds. These are useful for construction of these type of aggregation operators, especially using interpolation schemata.

متن کامل

On Gâteaux Differentiability of Pointwise Lipschitz Mappings

Abstract. We prove that for every function f : X → Y , where X is a separable Banach space and Y is a Banach space with RNP, there exists a set A ∈ Ã such that f is Gâteaux differentiable at all x ∈ S(f) \ A, where S(f) is the set of points where f is pointwise-Lipschitz. This improves a result of Bongiorno. As a corollary, we obtain that every K-monotone function on a separable Banach space is...

متن کامل

A Prevalent Transversality Theorem for Lipschitz Functions

This paper provides a version of the transversality theorem for a class of Lipschitz functions of the form f : R × C → Rn where C is a convex subset of a normed vector space Z indexing the parameters in the problem. The set C may be infinite-dimensional, and the notion of generic used is the measure-theoretic notion of prevalence introduced by Hunt, Sauer and Yorke (1992) and Christensen (1974)...

متن کامل

A pointwise limit theorem for filtered backprojection in computed tomography.

Computed tomography (CT) is one of the most important areas in the modern science and technology. The most popular approach for image reconstruction is filtered backprojection. It is essential to understand the limit behavior of the filtered backprojection algorithms. The classic results on the limit of image reconstruction are typically done in the norm sense. In this paper, we use the method ...

متن کامل

A Pointwise Ergodic Theorem for Imprecise Markov Chains

We prove a game-theoretic version of the strong law of large numbers for submartingale differences, and use this to derive a pointwise ergodic theorem for discrete-time Markov chains with finite state sets, when the transition probabilities are imprecise, in the sense that they are only known to belong to some convex closed set of probability measures.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Set-Valued and Variational Analysis

سال: 2017

ISSN: 1877-0533,1877-0541

DOI: 10.1007/s11228-017-0455-2